Automated theorem proving - PDFSEARCH.IO - Document Search Engine

Automated theorem proving
Results: 768

#	Item
461	Specification and Proof of Programs with Frama-C SAC 2013 Tutorial Nikolai Kosmatov, Virgile Prevosto, Julien Signoles CEA LIST Add to Reading List Source URL: kosmatov.perso.sfr.fr Language: English - Date: 2013-03-25 09:07:11 Formal methods Frama-C ANSI/ISO C Specification Language Program logic Theoretical computer science Formal verification Hoare logic Mathematical proof Automated theorem proving Software engineering Software Computing
462	Enhancing Symbolic Execution with Veritesting Thanassis Avgerinos, Alexandre Rebert, Sang Kil Cha, and David Brumley Carnegie Mellon University {thanassis, alexandre, sangkilc, dbrumley}@cmu.edu Add to Reading List Source URL: users.ece.cmu.edu Language: English - Date: 2014-03-17 03:36:49 Software testing Automated theorem proving Concolic testing Software metrics KeY Symbolic execution Code coverage Control flow graph Algorithm Software Computing Formal methods
463	Unleashing M AYHEM on Binary Code Sang Kil Cha, Thanassis Avgerinos, Alexandre Rebert and David Brumley Carnegie Mellon University Pittsburgh, PA {sangkilc, thanassis, alexandre.rebert, dbrumley}@cmu.edu Add to Reading List Source URL: users.ece.cmu.edu Language: English - Date: 2014-02-15 14:07:11 Theoretical computer science Automated theorem proving Concolic testing Symbolic execution KeY Parallel computing X86 Type system Algorithm Data types Formal methods Computing
464	Mainstream Contributions of Interval Computations in Engineering and Scientific Computing Add to Reading List Source URL: www.cs.utep.edu Language: English - Date: 2008-11-23 16:32:42 Computer arithmetic Data types Numerical analysis Arithmetic Interval arithmetic Automated theorem proving Interval Floating point Integral Mathematics Mathematical software Science
465	UITP 2005 Preliminary Version The User Interface of the KIV Verification System — A System Description Dominik Haneberg, Simon B¨aumler, Michael Balser, Holger Grandy, Frank Ortmeier, Wolfgang Reif, Add to Reading List Source URL: www.isse.uni-augsburg.de Language: English - Date: 2014-12-01 09:19:17 Formal methods Automated theorem proving Proof assistant ACL2 KeY Theorem Isabelle Mathematical logic Formal verification Mathematics Theoretical computer science Mathematical software
466	Efficient CNF Simplification based on Binary Implication Graphs⋆ Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-06-03 17:52:43 Propositional calculus Automated theorem proving Mathematical logic Logic in computer science NP-complete problems Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Logic Mathematics
467	Mechanical Verification of SAT Refutations with Extended Resolution Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt Jr. ⋆ The University of Texas at Austin Abstract. We present a mechanically-verified proof che Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2013-07-31 07:11:51 Logic Unit propagation Resolution Conjunctive normal form Clause Literal ACL2 Logic programming First-order logic Theoretical computer science Mathematical logic Automated theorem proving
468	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:39 NP-complete problems Logic in computer science Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Conjunctive normal form Search algorithm Unit propagation Theoretical computer science Applied mathematics Mathematics
469	MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2 Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:41:50 Mathematics Propositional calculus Unsatisfiable core Conjunctive normal form Resolution Logic programming First-order logic Logic Mathematical logic Automated theorem proving
470	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics

UPDATE